#include<bits/stdc++.h>
using namespace std;
int n;
int bkt[100050];
int maxn=0;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        int tmp;
        scanf("%d",&tmp);
        bkt[tmp]++;
        maxn=max(maxn,tmp);
    }
    int pre=0;
    while(bkt[pre]==0) pre++;
    int ans=bkt[pre];
    for(int now=pre+1;;now<=maxn){
        while(bkt[now]==0) now++;
        if(bkt[now]>ans) ans=bkt[now];
    }
    printf("%d",ans);
    return 0;
}
